Petri nets and regular languages
نویسندگان
چکیده
منابع مشابه
Supervisory Control of Deterministic Petri Nets with Regular Speciication Languages
Algorithms for computing a minimally restrictive control in the context of supervisory control of discrete event systems have been well developed when both the plant and the desired behavior are given as regular languages. In this paper we extend such prior results by presenting an algorithm for computing a minimally restrictive control when the plant behavior is a deterministic Petri net langu...
متن کاملRegular stochastic Petri nets
An extension of regular nets, a class of coloredd nets, to a stochastic model is proposed. We show that the symmetries in this class of nets make it pos sible to developp a performance evaluation by constructingg only a graph of symbolic markings, which ver tices are classes of states, insteadd of the whole reachability graph. Usingg algebraic techniques, we prove that all the states in a class...
متن کاملPetri Nets and Regular Processes
We consider the following problems: (a) Given a labelled Petri net and a finite automaton, are they equivalent? (b) Given a labelled Petri net, is it equivalent to some (unspecified) finite automaton? These questions are studied within the framework of trace and bisimulation equivalences, in both their strong and weak versions. (In the weak version a special action—likened to an "-move in autom...
متن کاملPetri Nets, Flat Languages and Linear Arithmetic
We present a method for characterizing the least xed-points of a certain class of Datalog programs in Presburger arithmetic. The method consists in applying some rules of decomposition that transform general sets of computation paths into \\at" ones. We apply the method for expressing the reachability relation of Petri nets as a linear arithmetic formula in order to prove (or disprove) their sa...
متن کاملPetri Net DAG Languages and Regular Tree Languages with Synchronization
A true-concurrency semantics is often given via pomsets. A pomset is an abstract directed acyclic graph that is in addition transitive: any grandson of a node is also a son of that node. We will drop this rather artificial transitive property in this paper and research abstract directed acyclic graphs (dags) as a true-concurrency semantics for Petri nets and their relation to regular languages ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1981
ISSN: 0022-0000
DOI: 10.1016/0022-0000(81)90067-2